The spectrum of a finite pseudocomplemented lattice
نویسندگان
چکیده
Let L be a finite pseudocomplemented lattice. Every interval [0, a] in L is pseudocomplemented, so by Glivenko’s theorem, the set S(a) of all pseudocomplements in [0, a] forms a boolean lattice. Let Bi denote the finite boolean lattice with i atoms. We describe all sequences (s0, s1, . . . , sn) of integers, for which there exists a finite pseudocomplemented lattice L with si = |{ a ∈ L | S(a) ∼= Bi }|, for all i, and there is no a ∈ L with S(a) ∼= Bn+1. This result settles a problem raised by the first author in 1971.
منابع مشابه
Pseudocomplementation in (normal) subgroup lattices
The goal of this paper is to study finite groups admitting a pseudocomplemented subgroup lattice (PK-groups) or a pseudocomplemented normal subgroup lattice (PKN-groups). In particular, we obtain a complete classification of finite PK-groups and of finite nilpotent PKN-groups. We also study groups with a Stone normal subgroup lattice, and we classify finite groups for which every subgroup has a...
متن کاملLattices of regular closed subsets of closure spaces
For a closure space (P,φ) with φ(∅) = ∅, the closures of open subsets of P , called the regular closed subsets, form an ortholattice Reg(P,φ), extending the poset Clop(P,φ) of all clopen subsets. If (P,φ) is a finite convex geometry, then Reg(P, φ) is pseudocomplemented. The Dedekind-MacNeille completion of the poset of regions of any central hyperplane arrangement can be obtained in this way, ...
متن کاملReducibility in Finite Posets
All the posets/lattices considered here are finite with element 0. An element x of a poset satisfying certain properties is deletable if P − x is a poset satisfying the same properties. A class of posets is reducible if each poset of this class admits at least one deletable element. When restricted to lattices, a class of lattices is reducible if and only if one can go from any lattice in this ...
متن کاملPseudocomplements of closure operators on posets
Some recent results provide su,cient conditions for complete lattices of closure operators on complete lattices, ordered pointwise, to be pseudocomplemented. This paper gives results of pseudocomplementation in the more general setting of closure operators on mere posets. The following result is 0rst proved: closure operators on a meet-continuous meet-semilattice form a pseudocomplemented compl...
متن کاملA Note on Negation: A PCS-Completion of Semilattices
In the paper “Which concept lattices are pseudocomplemented?” ([GK05]) we gave a contextual characterization of pseudocomplemented concept lattices by means of the arrow relations. In this contribution we use this description to embed finite semilattices into pseudocomplemented semilattices. This process can be used to define a negation on concepts.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009